Fixed Parameter Set Splitting , Obtaining a Linear Kernel and Improving Running Time
نویسندگان
چکیده
We study the problem k-SET SPLITTING from a Fixed Parameter point of view. We give a linear kernel of 2k elements and 2k sets and improve on the current best running time for the problem, giving a O∗(4k) algorithm. This is done by reducing the problem to a bipartite graph problem where we use crown decomposition to reduce the graph. We show that this result also gives a good kernel for Max Cut.
منابع مشابه
Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time
We study the problem k-Set Splitting in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal Set Cover, and using this to reduce the problem to a series of small instances of Max Sat. We also give a linear kernel containin...
متن کاملF IXED P ARAMETER S ET S PLITTING Fixed Parameter Set Splitting , Linear Kernel and Improved Running Time 1
We study the problem k-SET SPLITTING in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal SET COVER, and using this to reduce the problem to a series of small instances of MAX SAT. We also give a linear kernel containin...
متن کاملEven Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U , a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that there are at least k sets in F that have non-empty intersection with both B and W . In this paper we study p-Set Splitting from the view point of kernelization and parameterized algorithms. Given an instance (U,F , k)...
متن کاملA Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
A graph G is called a block graph if each maximal 2-connected component of G is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed parameter tractable (FPT) and kernelization algorithm. In particular, an input to Block Graph Vertex Deletion consists of a graph G and a positive integer k and the objective to check whether there exists a subset S ⊆ V (G...
متن کاملGraph-Modeled Data Clustering
ly speaking, what have we done in the previous section? After applying a number of rules in polynomial time to an instance of VERTEX COVER, we arrived at a reduced instance whose size can solely be expressed in terms of the parameter k. Since this can be easily done in O(n) time, we have found a data reduction for VERTEX COVER with guarantees concerning its running time as well as its effective...
متن کامل